A Generalization of Resource-Bounded Measure, with Application to the BPP vs. EXP Problem
نویسندگان
چکیده
We introduce resource-bounded betting games, and propose a generalization of Lutz’s resource-bounded measure in which the choice of next string to bet on is fully adaptive. Lutz’s martingales are equivalent to betting games constrained to bet on strings in lexicographic order. We show that if strong pseudo-random number generators exist, then betting games are equivalent to martingales, for measure on E and EXP. However, we construct betting games that succeed on certain classes whose Lutz measures are important open problems: the class of polynomial-time Turing-complete languages in EXP, and its superclass of polynomial-time Turing-autoreducible languages. If an EXP-martingale succeeds on either of these classes, or if betting games have the “finite union property” possessed by Lutz’s measure, one obtains the non-relativizable consequence ∗CWI, Kruislaan 413, 1098SJ Amsterdam, The Netherlands. Partially supported by the Dutch foundation for scientific research (NWO) through SION project 612-34-002, and by the European Union through NeuroCOLT ESPRIT Working Group Nr. 8556, and HC&M grant nr. ERB4050PL93-0516. E-mail: [email protected]. †DIMACS Center, Rutgers University, 96 Frelinghuysen Road, CoRE Building Room 419, Piscataway, NJ 08854-8018 USA. Partly supported by the European Union through Marie Curie Research Training Grant ERB-4001-GT-96-0783 at CWI and at the University of Amsterdam; by NSF Grant CCR 92-53582; and by the Fields Institute of the University of Toronto; research performed mainly at the University of Chicago. E-mail: [email protected] ‡Department of Computer Science and Engineering, State Univ. of NY at Buffalo, 226 Bell Hall, Buffalo, NY 14260-2000 USA. Supported in part by the National Science Foundation under Grant CCR-9409104. E-mail: [email protected] §IBM Almaden Research Center, Dept. K-53, 650 Harry Road San Jose, CA 95120 USA. Part of this research was performed while at the State Univ. of N.Y. at Buffalo, supported in part by National Science Foundation Grant CCR-9409104. E-mail: [email protected] ¶AT&T Labs Room C216, 180 Park Ave, Florham Park, NJ 07932-0971 USA. Research performed while at Rutgers University and Iowa State University, supported by NSF grants CCR-9204874 and CCR-9157382. E-mail: [email protected]
منابع مشابه
A Generalization of Resource - Bounded Measure , With Application to theBPP vs
We introduce resource-bounded betting games, and propose a generalization of Lutz's resourcebounded measure in which the choice of next string to bet on is fully adaptive. Lutz's martingales are equivalent to betting games constrained to bet on strings in lexicographic order. We show that if strong pseudo-random number generators exist, then betting games are equivalent to martingales, for meas...
متن کاملA Generalization of Resource-Bounded Measure, With an Application (Extended Abstract)
We introduce resource-bounded betting games, and propose a generalization of Lutz's resource-bounded measure in which the choice of next string to bet on is fully adaptive. Lutz's martingales are equivalent to betting games constrained to bet on strings in lexicographic order. We show that if strong pseudo-random number generators exist, then betting games are equivalent to martingales, for mea...
متن کاملPolynomial-Time Random Oracles and Separating Complexity Classes
Bennett and Gill (1981) showed that P 6= NP 6= coNP for a random oracle A, with probability 1. We investigate whether this result extends to individual polynomial-time random oracles. We consider two notions of random oracles: p-random oracles in the sense of martingales and resource-bounded measure (Lutz, 1992; Ambos-Spies et al., 1997), and p-betting-game random oracles using the betting game...
متن کاملTwo Results on Resource-Bounded Measure
We construct an oracle relative to which NP has p-measure 0 but D p has measure 1 in EXP. This gives a strong relativized negative answer to a question posed by Lutz Lut96]. Secondly, we give strong evidence that BPP is small. We show that BPP has p-measure 0 unless EXP = MA and the polynomial-time hierarchy collapses. This contrasts the work of Regan et al. RSC95], where it is shown that P=pol...
متن کاملResults on Resource - Bounded
We construct an oracle relative to which NP has p-measure 0 but D p has measure 1 in EXP. This gives a strong relativized negative answer to a question posed by Lutz Lut96]. Secondly, we give strong evidence that BPP is small. We show that BPP has p-measure 0 unless EXP = MA and thus the polynomial-time hierarchy collapses. This contrasts with the work of Regan et. al. RSC95], where it is shown...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Comput.
دوره 30 شماره
صفحات -
تاریخ انتشار 1998